An Abstract Path Ordering
نویسنده
چکیده
Abstract combinatorial commutation properties for separating well-foundedness of unions of relations can be applied to generic path orderings used in termination proofs.
منابع مشابه
Solving Symbolic Ordering Constraints
Received Revised ABSTRACT We show how to solve boolean combinations of inequations s > t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.
متن کاملJumping and escaping: Modular termination and the abstract path ordering
Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called “jumping”, along with a weakened version of the lifting property, called “escaping” and requiring only an eventual lifting, are used for proving wellfound...
متن کاملA new ordering constraint solving method and its applications
We show that it is possible to transform any given LPO ordering constraint C into a finite equivalent set of constraints S for which a special kind of solutions can be obtained. This allows to compute the equalities that follow from ordering constraints, and to decide e.g. whether an ordering constrained equation is a tautology. Another application we develop here is a method to check ordered r...
متن کاملThe Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. The obtained ordering is well-founded, compatible with -reductions and with polymorphic typing, monotonic with respect to the funct...
متن کامل(HO)RPO Revisited
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present paper, we study in more details the relations between the computability closure and the (higher-order) recursive path ordering. We show that the first-order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010